Federated Edge Intelligence and Edge Caching Mechanisms

Sufficient conditions for maximally edge-connected and super-edge-connected

Let $G$ be a connected graph with minimum degree $delta$ and edge-connectivity $lambda$. A graph ismaximally edge-connected if $lambda=delta$, and it is super-edge-connected if every minimum edge-cut istrivial; that is, if every minimum edge-cut consists of edges incident with a vertex of minimum degree.In this paper, we show that a connected graph or a connected triangle-free graph is maximall...

Edge Caching in a Small Cell Network

An explosive growth of the use of the public internet by mobile phones along with new high speed data technologies increases the challenge of mobile data delivery. The owners of popular media typically use content delivery networks (CDN) to distribute their content. Currently there is no collaboration between the CDNs and the mobile networks. In this paper we present a novel method for caching ...

Mobile Edge Caching: An Optimal Auction Approach

With the explosive growth of wireless data, the sheer size of the mobile traffic is challenging the capacity of current wireless systems. To tackle this challenge, mobile edge caching has emerged as a promising paradigm recently, in which the service providers (SPs) prefetch some popular contents in advance and cache them locally at the network edge. When requested, those locally cached content...

Binomial edge ideals and rational normal scrolls

‎Let $X=left(‎ ‎begin{array}{llll}‎ ‎ x_1 & ldots & x_{n-1}& x_n\‎ ‎ x_2& ldots & x_n & x_{n+1}‎ ‎end{array}right)$ be the Hankel matrix of size $2times n$ and let $G$ be a closed graph on the vertex set $[n].$ We study the binomial ideal $I_Gsubset K[x_1,ldots,x_{n+1}]$ which is generated by all the $2$-minors of $X$ which correspond to the edges of $G.$ We show that $I_G$ is Cohen-Macaula...

Cutting Edge: Two Distinct Mechanisms